منابع مشابه
Pan-H-Linked Graphs
LetH be a multigraph, possibly containing loops. AnH-subdivision is any simple graph obtained by replacing the edges of H with paths of arbitrary length. Let H be an arbitrary multigraph of order k, size m, n0(H) isolated vertices and n1(H) vertices of degree one. In [10] it was shown that if G is a simple graph of order n containing an H-subdivision H and δ(G) ≥ n+m−k+n1(H)+2n0(H) 2 , then G c...
متن کاملOn H-Linked Graphs
For a fixed multigraph H , possibly containing loops, with V (H) = {h1, . . . , hk}, we say a graph G is H -linked if for every choice of k vertices v1, . . . , vk in G, there exists a subdivision of H in G such that vi represents hi (for all i). This notion clearly generalizes the concept of k-linked graphs (as well as other properties). In this paper we determine, for a connected multigraph H...
متن کاملOn strongly 2-multiplicative graphs
In this paper we obtain an upper bound and also a lower bound for maximum edges of strongly 2 multiplicative graphs of order n. Also we prove that triangular ladder the graph obtained by duplication of an arbitrary edge by a new vertex in path and the graphobtained by duplicating all vertices by new edges in a path and some other graphs are strongly 2 multiplicative
متن کاملIntrinsically Triple Linked Complete Graphs
We prove that every embedding of K10 in R3 contains a non-split link of three components. We also exhibit an embedding of K9 with no such link of three components.
متن کاملLinked graphs with restricted lengths
A graph G is k-linked if G has at least 2k vertices, and for every sequence x1, x2, . . . , xk, y1, y2, . . . , yk of distinct vertices, G contains k vertex-disjoint paths P1, P2, . . . , Pk such that Pi joins xi and yi for i = 1, 2, . . . , k. Moreover, the above defined k-linked graphG is k-linked modulo (m1,m2, . . . ,mk) if, in addition, for any ktuple (d1, d2, . . . , dk) of natural number...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Combinatorics
سال: 1980
ISSN: 0195-6698
DOI: 10.1016/s0195-6698(80)80039-4